home *** CD-ROM | disk | FTP | other *** search
/ Shareware Grab Bag / Shareware Grab Bag.iso / 090 / calc.arc / CALC.C next >
C/C++ Source or Header  |  1985-11-24  |  19KB  |  602 lines
  1. /* 
  2. *  CALC.C
  3. *  
  4. *  Author:  R. E. Sawyer
  5. * 
  6. *  Date:  16 Nov 85
  7. *
  8. *  Language:  C (DeSmet V2.4)
  9. *
  10. *  Description:  CALC is an interactive RPN-style calculator.  Each line of
  11. *                instructions entered at the keyboard is immediately interp-
  12. *                reted, and CALC may also be directed to save each line in a 
  13. *                journal file for later re-play. Such a file may also be
  14. *                created by previous use of a text editor.
  15. */
  16.  
  17. #include <math.h>
  18. #include <stdio.h>
  19.  
  20. #define MAXLINE    80
  21. #define MAXWORD    20
  22. #define MAXSTACK   100
  23. #define MAXMEM     100
  24. #define MAXKEY     100
  25. #define MAXVAR     100
  26. #define MAXVLEN    6
  27. #define TAB        "        "
  28.  
  29. FILE *fin = 0;
  30. FILE *fout = 0;
  31. int isfromfile = 0;
  32. int istofile = 0;
  33.  
  34. static char vname[MAXVAR][MAXVLEN] = {"\0"};
  35. static double val[MAXVAR] = {0.0};
  36. int vnum = 0;
  37.  
  38. int sp = 0;
  39. double stack[MAXSTACK+1];
  40. double mem[MAXMEM+1];
  41. extern double atof();
  42.  
  43. static char *keyword[] = {
  44.                          "HELP  display this summary",
  45.                          "QUIT  exit CALC",
  46.                          "nnn   append s0 = any number nnn",
  47.                          "abc   append s0 = value of variable abc",
  48.                          "=abc  store s0 as variable abc, delete s0",
  49.                          "=     display s0",
  50.                          "+     s0 <-- s1 + s0, delete s1",
  51.                          "-     s0 <-- s1 - s0, delete s1",
  52.                          "*     s0 <-- s1 * s0, delete s1",
  53.                          "/     s0 <-- s1 / s0, delete s1",
  54.                          "^     s0 <-- s1 to the power s0, delete s1",
  55.                          "?<    s0 <-- 1(0) if s1 < (>=) s0, delete s1",
  56.                          "?<=   s0 <-- 1(0) if s1 <= (>) s0, delete s1",
  57.                          "?=    s0 <-- 1(0) if s1 = (<>) s0, delete s1",
  58.                          "ABS   s0 <-- absolute value of s0",
  59.                          "ACOS  s0 <-- arccosine of s0",
  60.                          "ASIN  s0 <-- arcsine of s0",
  61.                          "ATAN  s0 <-- arctangent of s0",
  62.                          "CEIL  s0 <-- least integer not less than s0",
  63.                          "CHS   s0 <-- -s0",
  64.                          "COS   s0 <-- cosine of s0",
  65.                          "COSH  s0 <-- hyperbolic cosine of s0",
  66.                          "EXP   s0 <-- e to the power s0",
  67.                          "EXP10 s0 <-- 10 to the power s0",
  68.                          "FLOOR s0 <-- greatest integer not greater than s0",
  69.                          "INV   s0 <-- 1 / s0",
  70.                          "LOG   s0 <-- base e logarithm of s0",
  71.                          "LOG10 s0 <-- base 10 logarithm of s0",
  72.                          "MAX   s0 <-- maximum of s0 & s1, delete s1",
  73.                          "MIN   s0 <-- minimum of s0 & s1, delete s1",
  74.                          "MOD   s0 <-- s1 modulo s0, delete s1",
  75.                          "PSE   pause until any key is typed (and ignored)",
  76.                          "PI    append s0 = 3.14159...",
  77.                          "SIN   s0 <-- sine of s0",
  78.                          "SINH  s0 <-- hyperbolic sine of s0",
  79.                          "SQR   s0 <-- s0 * s0",
  80.                          "SQRT  s0 <-- square root of s0",
  81.                          "TAN   s0 <-- tangent of s0",
  82.                          "TANH  s0 <-- hyperbolic tangent of s0",
  83.                          "CL0   delete s0",
  84.                          "CLA   delete stack & variables, zero all registers",
  85.                          "CLM   zero all registers",
  86.                          "CLS   delete stack",
  87.                          "CLV   delete all variables",
  88.                          "RCL   append s0 = register s0",
  89.                          "SHO   display stack",
  90.                          "XCH   exchange s0,s1",
  91.                          "STO   store s1 in register s0, delete s0",
  92.                          "STO+  add s1 to register s0, delete s0",
  93.                          "STO-  subtract s1 from register s0, delete s0",
  94.                          "STO*  multiply register s0 by s1, delete s0",
  95.                          "STO/  divide register s0 by s1, delete s0",
  96.                          "<<abc  execute instructions in file abc",
  97.                          ">>abc  begin saving instructions to file abc",
  98.                          ">>     stop saving instructions to file"
  99.                          };
  100.  
  101. main()
  102.     {
  103.     int i, j;
  104.     char line[MAXLINE+1];
  105.     char word[MAXWORD+1];
  106.     int start;
  107.     int iop1;
  108.     double op1, op2;
  109.     double push(), pop();
  110.     FILE *opener();
  111.  
  112.     header();
  113.     while (TRUE)
  114.         {
  115.         start = 0;
  116.         if (!isfromfile)
  117.             printf("CALC> ");
  118.         getline(line);
  119.         if (istofile && !(line[0] == '>' && line[1] == '>'))
  120.             {
  121.             fputs(line,fout);
  122.             fputs("\n",fout);
  123.             }
  124.         if (isfromfile)
  125.             printf("%s",line);
  126.         while (getword(word, line, &start))
  127.             {
  128.             if (word[0] == '<' && word[1] == '<')
  129.                 {
  130.                 fin = opener(word+2,0);
  131.                 isfromfile = fin;
  132.                 break;
  133.                 }
  134.             if (word[0] == '>' && word[1] == '>')
  135.                 {
  136.                 if (istofile)
  137.                    {
  138.                    fclose(fout);
  139.                    istofile = 0;
  140.                    }
  141.                 else if (!isfromfile)
  142.                    {
  143.                    fout = opener(word+2,1);
  144.                    istofile = fout;                    
  145.                    break;
  146.                    }
  147.                 }
  148.             else if (word[0] == '=' && isalpha(word[1]))
  149.                 if (sp > 0)
  150.                     if ( (i=search(vname,word+1)) >= 0 )
  151.                         val[i] = pop();
  152.                     else
  153.                         if (vnum <= MAXVAR)
  154.                             {
  155.                             strcpy(vname+vnum, word+1);
  156.                             val[vnum] = pop();
  157.                             ++vnum;
  158.                             }
  159.                         else
  160.                             printf("%sNo room for %s.\n",TAB,word+1);
  161.                 else
  162.                     printf("%sNothing to store in %s.\n",TAB,word+1);
  163.             else if (isdigit(word[0]) || word[0] == '.')
  164.                 push(atof(word));
  165.             else if (word[0] == '-' && (isdigit(word[1]) || word[1] == '.'))
  166.                 push(-atof(word+1));
  167.             else if (is(word,"CL0"))
  168.                 if (sp > 0)
  169.                     pop();
  170.                 else
  171.                     printf("%sNothing to clear.\n",TAB);
  172.             else if (is(word,"STO"))
  173.                 if ((iop1 = (int)pop()) <= MAXMEM && iop1 >= 0)
  174.                     mem[iop1] = push(pop());
  175.                 else
  176.                     {
  177.                     printf("%sMust have 0<=M<=%3.0d in M STO.\n",TAB,MAXMEM);
  178.                     break;
  179.                     }
  180.             else if (is(word,"STO+"))
  181.                 if ((iop1 = (int)pop()) <= MAXMEM && iop1 >= 0)
  182.                     mem[iop1] += push(pop());
  183.                 else
  184.                     {
  185.                     printf("%sMust have 0<=M<=%3.0d in M STO.\n",TAB,MAXMEM);
  186.                     break;
  187.                     }
  188.             else if (is(word,"STO-"))
  189.                 if ((iop1 = (int)pop()) <= MAXMEM && iop1 >= 0)
  190.                     mem[iop1] -= push(pop());
  191.                 else
  192.                     {
  193.                     printf("%sMust have 0<=M<=%3.0d in M STO.\n",TAB,MAXMEM);
  194.                     break;
  195.                     }
  196.             else if (is(word,"STO*"))
  197.                 if ((iop1 = (int)pop()) <= MAXMEM && iop1 >= 0)
  198.                     mem[iop1] *= push(pop());
  199.                 else
  200.                     {
  201.                     printf("%sMust have 0<=M<=%3.0d in M STO.\n",TAB,MAXMEM);
  202.                     break;
  203.                     }
  204.             else if (is(word,"STO/"))
  205.                 if ((iop1 = (int)pop()) <= MAXMEM && iop1 >= 0)
  206.                     mem[iop1] /= push(pop());
  207.                 else
  208.                     {
  209.                     printf("%sMust have 0<=M<=%3.0d in M STO.\n",TAB,MAXMEM);
  210.                     break;
  211.                     }
  212.             else if (is(word,"RCL"))
  213.                 if ((iop1 = (int)pop()) <= MAXMEM && iop1 >= 0)
  214.                     push(mem[iop1]);
  215.                 else
  216.                     {
  217.                     printf("%sMust have 0<=M<=%3.0d in M RCL.\n",TAB,MAXMEM);
  218.                     break;
  219.                     }
  220.             else if (is(word,"+"))
  221.                 push(pop() + pop());
  222.             else if (is(word,"*"))
  223.                 push(pop() * pop());
  224.             else if (is(word,"-"))
  225.                 {
  226.                 op2 = pop();
  227.                 push(pop() - op2);
  228.                 }
  229.             else if (is(word,"/"))
  230.                 {
  231.                 op2 = pop();
  232.                 if (op2 != 0.0)
  233.                     push(pop() / op2);
  234.                 else
  235.                     {
  236.                     printf("%sAttempted division by zero.\n",TAB);
  237.                     break;
  238.                     }
  239.                 }
  240.             else if (is(word,"?<"))
  241.                 {
  242.                 op2 = pop();
  243.                 push(pop() < op2 ? 1.0 : 0.0);
  244.                 }
  245.             else if (is(word,"?<="))
  246.                 {
  247.                 op2 = pop();
  248.                 push(pop() <= op2 ? 1.0 : 0.0);
  249.                 }
  250.             else if (is(word,"?="))
  251.                 {
  252.                 op2 = pop();
  253.                 push(pop() == op2 ? 1.0 : 0.0);
  254.                 }
  255.             else if (is(word,"CHS"))
  256.                 push(-pop());
  257.             else if (is(word,"XCH"))
  258.                 {
  259.                 op1 = pop();
  260.                 op2 = pop();
  261.                 push(op1);
  262.                 push(op2);
  263.                 }
  264.             else if (is(word,"INV"))
  265.                 if ((op1=pop()) != 0.0)
  266.                     push(1.0 / pop());
  267.                 else
  268.                     {
  269.                     printf("%sMust have X<>0 in 1/X.\n",TAB);
  270.                     break;
  271.                     }
  272.             else if (is(word,"ABS"))
  273.                 push(fabs(pop()));
  274.             else if (is(word,"ACOS"))
  275.                 push(acos(pop()));
  276.             else if (is(word,"ASIN"))
  277.                 push(asin(pop()));
  278.             else if (is(word,"ATAN"))
  279.                 push(atan(pop()));
  280.             else if (is(word,"CEIL"))
  281.                 push(ceil(pop()));
  282.             else if (is(word,"COS"))
  283.                 push(cos(pop()));
  284.             else if (is(word,"EXP"))
  285.                 push(exp(pop()));
  286.             else if (is(word,"EXP10"))
  287.                 push(exp10(pop()));
  288.             else if (is(word,"FLOOR"))
  289.                 push(floor(pop()));
  290.             else if (is(word,"LOG"))
  291.                 if ((op1=pop()) > 0.0)
  292.                     push(log(op1));
  293.                 else
  294.                     {
  295.                     printf("%sMust have X>0 in LOG(X).\n",TAB);
  296.                     break;
  297.                     }
  298.             else if (is(word,"LOG10"))
  299.                 if ((op1=pop()) > 0.0)
  300.                     push(log10(op1));
  301.                 else
  302.                     {
  303.                     printf("%sMust have X>0 LOG10(X).\n",TAB);
  304.                     break;
  305.                     }
  306.             else if (is(word,"^"))
  307.                 if ((op2 = pop()) > 0.0)
  308.                     push(pow(pop(), op2));
  309.                 else
  310.                     {
  311.                     printf("%sMust have X>0 in X^Y.\n", TAB);
  312.                     break;
  313.                     }
  314.             else if (is(word,"SIN"))
  315.                 push(sin(pop()));
  316.             else if (is(word,"SQR"))
  317.                 push((op1=pop()) * op1);
  318.             else if (is(word,"SQRT"))
  319.                 if ((op1=pop()) >= 0.0)
  320.                     push(sqrt(op1));
  321.                 else
  322.                     {
  323.                     printf("%sMust have X>=0 in SQRT(X).\n",TAB);
  324.                     break;
  325.                     }
  326.             else if (is(word,"TAN"))
  327.                 push(tan(pop()));
  328.             else if (is(word,"MIN"))
  329.                 {
  330.                 op2 = pop();
  331.                 push(((op1 = pop()) < op2) ? op1 : op2);
  332.                 }
  333.             else if (is(word,"MAX"))
  334.                 {
  335.                 op2 = pop();
  336.                 push(((op1 = pop()) > op2) ? op1 : op2);
  337.                 }
  338.             else if (is(word,"SINH"))
  339.                 push(0.5*(exp(op1=pop()) - exp(-op1)));
  340.             else if (is(word,"COSH"))
  341.                 push(0.5*(exp(op1=pop()) + exp(-op1)));
  342.             else if (is(word,"TANH"))
  343.                 {
  344.                 op2 = exp(op1=pop()) - exp(-op1);
  345.                 push(op2 / (exp(op1) + exp(-op1)));
  346.                 }
  347.             else if (is(word,"PI"))
  348.                 push(4.0*atan(1.0));
  349.             else if (is(word,"="))
  350.                 if (sp > 0)
  351.                     printf("%s%20.14le\n", TAB, push(pop()));
  352.                 else
  353.                     printf("%sStack empty.\n",TAB);
  354.             else if (is(word,"CLS"))
  355.                 clearstack();
  356.             else if (is(word,"CLM"))
  357.                 clearmem();
  358.             else if (is(word,"CLV"))
  359.                 clearvar();
  360.             else if (is(word,"CLA"))
  361.                 {
  362.                 clearstack();
  363.                 clearmem();
  364.                 clearvar();
  365.                 }
  366.             else if (is(word,"SHO"))
  367.                 showstack();
  368.             else if (is(word,"HELP"))
  369.                 help();
  370.             else if (is(word,"QUIT"))
  371.                 exit();
  372.             else if ( (i=search(vname,word)) >= 0 )
  373.                 push(val[i]);
  374.             else if (is(word,"PSE"))
  375.                 {
  376.                 getchar();
  377.                 putchar('\b\n');
  378.                 }
  379.             else 
  380.                 {
  381.                 printf("%sUnrecognized symbol:  %s\n", TAB, word);
  382.                 printf("%sDo you want help? (y/n) ",TAB);
  383.                 if (tolower(getchar()) == 'y')
  384.                     help();
  385.                 else
  386.                     printf("\n");
  387.                 }
  388.             }
  389.         }
  390.     }
  391.  
  392.  
  393. double push(x)
  394.     double x;
  395.     {
  396.     if (sp < MAXSTACK)
  397.         {
  398.         stack[sp++] = x;
  399.         }
  400.     else
  401.         {
  402.         printf("%sStack overflow.\n", TAB);
  403.         clearstack();
  404.         }
  405.     return (x);
  406.     }
  407.  
  408.  
  409. double pop()
  410.     {
  411.     double x;
  412.  
  413.     if (sp > 0)
  414.         x = stack[--sp];
  415.     else
  416.         {
  417.         printf("%sValue not found -- stack may be corrupted.\n", TAB);
  418.         clearstack();
  419.         x = 0.0;
  420.         }
  421.     return (x);
  422.     }
  423.  
  424.  
  425. void clearstack()
  426.    {
  427.    sp = 0;
  428.    }
  429.         
  430.  
  431. void showstack()
  432.     {
  433.     int i;
  434.     if (sp == 0)
  435.         {
  436.         printf("%sStack empty.\n", TAB);
  437.         return;
  438.         }
  439.     for (i=0; i<sp-1; ++i)
  440.         printf("%s%20.14le\n", TAB, stack[i]);
  441.     printf("%s%20.14le <--TOP\n", TAB, stack[sp-1]);
  442.     }
  443.  
  444.  
  445. void clearmem()
  446.     {
  447.     int i;
  448.  
  449.     for (i=0; i<=MAXMEM; ++i)
  450.         mem[i] = 0;
  451.     }
  452.  
  453.  
  454. void clearvar()
  455.     {
  456.     vnum = 0;
  457.     vname[0][0] = '\0';
  458.     }
  459.  
  460.  
  461. void help()
  462.     {
  463.     int i;
  464.  
  465.     printf("\n\n\n\n\n\n");
  466.     printf("%sCALC is an interactive RPN-style calculator with an \n",TAB);
  467.     printf("%sinstruction set resembling that of an HP calculator.\n",TAB);
  468.     printf("%sEach line of instructions entered at the keyboard is\n",TAB);
  469.     printf("%simmediately executed, and may also be automatically \n",TAB);
  470.     printf("%sjournaled in a command file.  CALC can be made to read\n",TAB);
  471.     printf("%sand execute the instructions on-file at any time.  A\n",TAB);
  472.     printf("%scommand file can also be created with a text editor.\n",TAB);
  473.     printf("\n%sAs in an HP calulator, instructions are interpreted\n",TAB);
  474.     printf("%sas \"Reverse Polish Notation\", and operate on values\n",TAB);
  475.     printf("%sstored on a \"stack\" -- a \"last-in first-out\" list.\n",TAB);
  476.     printf("%sThe stack is represented as (...,s2,s1,s0), where s0\n",TAB);
  477.     printf("%sis accessed first (\"top-of-stack\"), s1 is next, etc.\n",TAB);
  478.     printf("%sAll values are double precision (8-byte) floats.\n\n",TAB);
  479.     printf("%sThe following are valid symbols if separated by spaces:\n",TAB);
  480.     printf("\n\n\n\n\n\n");
  481.     more();
  482.     for (i=0; i<MAXKEY && *keyword[i] != '\0'; ++i)
  483.         {
  484.         if (i%24 == 0 && i>0)
  485.             more();
  486.         printf("%s%s\n",TAB,keyword[i]);
  487.         }
  488.     printf("\n\n");
  489.     }
  490.  
  491. more()
  492.     {
  493.     printf("-MORE-");
  494.     getchar();
  495.     printf("\b\b\b\b\b\b\b");
  496.     }
  497.  
  498. static char *q[3] = {"r","w","a"};
  499.  
  500. FILE *opener(s,t)
  501.     char *s;
  502.     int t;
  503.     {
  504.     FILE *f;
  505.  
  506.     if ((f = fopen(s,q[t])) == NULL)
  507.         printf("%sCan't open %s.\n",TAB,s);
  508.     return (f);
  509.     }
  510.  
  511.  
  512. /* get a line of text, from the keyboard or a file, to line[] string*/
  513. int getline(line)
  514.     char line[];
  515.     {
  516.     if (isfromfile)
  517.         {
  518.         if (fgets(line,MAXLINE,fin) == NULL)
  519.             {
  520.             fclose(fin);
  521.             isfromfile = 0;
  522.             }
  523.         }
  524.     else
  525.         gets(line);
  526.     }
  527.  
  528. /* get word-string from line-string beginning at index=start */
  529. /* return length of word-string */
  530.  
  531. int getword(word, line, start)
  532.     char word[];
  533.     char line[];
  534.     int *start;
  535.     {
  536.     int i, j;
  537.  
  538.     for (i=*start, j=0; line[i] != '\0'; ++i)
  539.         {
  540.         if (!isop(line[i]))
  541.             ;
  542.         else
  543.             {
  544.             for (j=0; j <= MAXWORD && isop(line[i]); ++j)
  545.                 word[j] = toupper(line[i++]);
  546.             word[j] = '\0';
  547.             *start = i;
  548.             break;
  549.             }
  550.         }
  551.     if (j == 0)
  552.         word[0] = '\0';
  553.     if (j > MAXWORD)
  554.         {
  555.         printf("%sSymbol too long:  %s", TAB, word);
  556.         for (i=*start; i<=MAXLINE && isop(line[i]); ++i)
  557.             printf("%c", toupper(line[i]));
  558.         printf("\n");
  559.         }
  560.     return (j);
  561.     } 
  562.  
  563.  
  564. /* return TRUE if c is in the alphabet for words */
  565.  
  566. int isop(c)
  567.     char c;
  568.     {
  569.     int i;
  570.  
  571.     if (c >= '!' && c <= '~')
  572.         return (TRUE);
  573.     else
  574.         return (FALSE);
  575.     }    
  576.  
  577.  
  578. int is(word, str)
  579.     char word[];
  580.     char str[];
  581.     {
  582.     return (strcmp(word, str) == 0);
  583.     }
  584.  
  585.  
  586. int search(var, word)
  587.     char var[][MAXVLEN];
  588.     char word[];
  589.     {
  590.     int i;
  591.  
  592.     for (i=0; i <= MAXVAR && (var[i][0] != '\0'); ++i)
  593.         if (is(word,var[i]))
  594.             return (i);
  595.     return (-1);
  596.     }
  597.  
  598. void header()
  599.     {
  600.     printf("\nCALC  --  R. E. Sawyer, 16 Nov 85\n\n");
  601.     }
  602.